Optimised Flooding Algorithms for Ad Hoc Networks

Information dissemination (flooding) forms an integral part of routing protocols, network management, service discovery and information collection. Given the broadcast nature of ad hoc network communications, information dissemination provides a challenging problem. In this paper we compare the performance of existing distributed ad hoc network flooding algorithms indentifying stengths and weaknesses inherent in each mechanism. Additionally we propose to apply the Minimum Spanning Tree (MST) algorithm in a distributed manner as the basis of an optimised ad hoc network flooding algorithm called Localised Minimum Spanning Tree Flooding (LMSTFlood). LMSTFlood provides significant reduction in duplicate packet reception, average transmission distance and energy consumed. Thus LMSTFlood limits the broadcast storm problem more effectively than existing optimised flooding mechanisms.